On schemata and $L$ systems for parallel algorithms

On Schemata and systems for parallel algorithms

— The parallel program schemata of Karp and Miller are considérée for unbounded parallelism and their main decidability result is extended to this case. The complexity of these schemata is investigated and a scheduling algorithm is presented whose sequential time complexity is polynomial. The scheduling algorithm is applied to a schema representing the StrassenWinograd algorithm for multiplicat...

On Maximally Parallel Schemata

A model for parallel computation called a schema is presented. This model is similar to that presented in the recent work of Karp and Miller 2 • Section 1 presents a description of the model, and some results on the characterization of computations within it. Section 2 stunIIlarizes some results on determinacy and equivalence. Section 3 presents a ~ormalization of the property of maximal parall...

Parallel Algorithms for Toeplitz Systems

We describe some parallel algorithms for the solution of Toeplitz linear systems and Toeplitz least squares problems. First we consider the parallel implementation of the Bareiss algorithm (which is based on the classical Schur algorithm). The alternative Levinson algorithm is less suited to parallel implementation because it involves inner products. The Bareiss algorithm computes the LU factor...

Parallel Parsing: Diierent Distribution Schemata for Charts

a new type-ii fuzzy logic based controller for non-linear dynamical systems with application to 3-psp parallel robot

abstract type-ii fuzzy logic has shown its superiority over traditional fuzzy logic when dealing with uncertainty. type-ii fuzzy logic controllers are however newer and more promising approaches that have been recently applied to various fields due to their significant contribution especially when the noise (as an important instance of uncertainty) emerges. during the design of type- i fuz...